Score certificate numbers of upset tournaments
نویسندگان
چکیده
منابع مشابه
Short Score Certificates for Upset Tournaments
A score certificate for a tournament, T , is a collection of arcs of T which can be uniquely completed to a tournament with the same scorelist as T ’s, and the score certificate number of T is the least number of arcs in a score certificate of T . Upper bounds on the score certificate number of upset tournaments are derived. The upset tournaments on n vertices are in one–to–one correspondence w...
متن کاملOn a conjecture of Quintas and arc-traceability in upset tournaments
A digraph D = (V, A) is arc-traceable if for each arc xy in A, xy lies on a directed path containing all the vertices of V , i.e., hamiltonian path. We prove a conjecture of Quintas [7]: if D is arc-traceable, then the condensation of D is a directed path. We show that the converse of this conjecture is false by providing an example of an upset tournament which is not arc-traceable. We then giv...
متن کاملLocal Out-Tournaments with Upset Tournament Strong Components I: Full and Equal {0, 1}-Matrix Ranks
A digraph D is a local out-tournament if the outset of every vertex: is a tournament. Here, we use local out-tournaments, whose strong components are upset tournaments, to explore the corresponding ranks of the adjacency matrices. Of specific interest is the out-tournament whose adjacency matrix has boolean, nonnegative integer, term, and real rank all equal to the number of vertices, n. Corres...
متن کاملChromatic Numbers of Products of Tournaments: FractionalAspects of Hedetniemi's Conjecture
The chromatic number of the categorical product of two n-tournaments can be strictly smaller than n. We show that min{χ(S × T ) : S and T are n-tournaments} is asymptotically equal to λn, where 12 ≤ λ ≤ 2 3 .
متن کاملAsymptotic Enumeration of Tournaments with a Given Score Sequence
A tournament is a digraph in which, for each pair of distinct vertices v and w, either (v,w) or (w, v) is an edge, but not both. A tournament is regular if the in-degree is equal to the out-degree at each vertex. Let v1, v2, . . . , vn be the vertices of a labelled tournament and let d−j , d + j be the in-degree and out-degree of vj for 1 ≤ j ≤ n. d+j is also called the score of vj . Define δj ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00243-7